TWO THEOREMS IN GRAPH THEORY

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preservation theorems in {L}ukasiewicz \model theory

We present some model theoretic results for {L}ukasiewiczpredicate logic by using the methods of continuous model theorydeveloped by Chang and Keisler.We prove compactness theorem with respect to the class of allstructures taking values in the {L}ukasiewicz $texttt{BL}$-algebra.We also prove some appropriate preservation theorems concerning universal and inductive theories.Finally, Skolemizatio...

متن کامل

Two Extremal Problems in Graph Theory

We consider the following two problems. (1) Let t and n be positive integers with n ≥ t ≥ 2. Determine the maximum number of edges of a graph of order n that contains neither Kt nor Kt,t as a subgraph. (2) Let r, t and n be positive integers with n ≥ rt and t ≥ 2. Determine the maximum number of edges of a graph of order n that does not contain r disjoint copies of Kt. Problem 1 for n < 2t is s...

متن کامل

On two problems in graph Ramsey theory

We study two classical problems in graph Ramsey theory, that of determining the Ramsey number of bounded-degree graphs and that of estimating the induced Ramsey number for a graph with a given number of vertices. The Ramsey number r(H) of a graph H is the least positive integer N such that every twocoloring of the edges of the complete graph KN contains a monochromatic copy of H. A famous resul...

متن کامل

Two Shorter Proofs in Spectral Graph Theory

Let G be a simple graph with V (E) as its vertex (respectively, edge) set. The spectrum of G is the spectrum of its adjacency matrix. For all other definitions (or notation not given here), especially those related to graph spectra, see [1]. The purpose of this note is to provide shorter proofs of two inequalities already known in spectral graph theory. The first bounds vertex eccentricities of...

متن کامل

Algebraic Combinatorics: Spectral Graph Theory, Erdös-Ko-Rado Theorems and Quantum Information Theory

László Babai Symmetry versus regularity Abstract: Symmetry is usually defined in terms of automorphisms; regularity in terms of numerical parameters. Symmetry conditions imply various regularity constraints, but not conversely. We shall discuss two areas of this relationship. First we review some old results by Peter Frankl on how symmetry and regularity constraints affect extremal set systems....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the National Academy of Sciences

سال: 1957

ISSN: 0027-8424,1091-6490

DOI: 10.1073/pnas.43.9.842